Tikhonov regularization with ℓ0-term complementing a~convex penalty: ℓ1-convergence under sparsity constraints

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence rates for regularization with sparsity constraints

Tikhonov regularization with p-powers of the weighted `p norms as penalties, with p ∈ (1, 2), have been lately employed in reconstruction of sparse solutions of ill-posed inverse problems. This paper points out convergence rates for such a regularization with respect to the norm of the weighted spaces, by assuming that the solutions satisfy certain smoothness (source) condition. The meaning of ...

متن کامل

Convergence rates and source conditions for Tikhonov regularization with sparsity constraints

This paper addresses the regularization by sparsity constraints by means of weighted lp penalties for 0 ≤ p ≤ 2. For 1 ≤ p ≤ 2 special attention is payed to convergence rates in norm and to source conditions. As main results it is proven that one gets a convergence rate of √ δ in the 2-norm for 1 < p ≤ 2 and in the 1-norm for p = 1 as soon as the unknown solution is sparse. The case p = 1 needs...

متن کامل

Fractional Tikhonov regularization with a nonlinear penalty term

Tikhonov regularization is one of the most popular methods for solving linear systems of equations or linear least-squares problems with a severely ill-conditioned matrix and an error-contaminated data vector (right-hand side). This regularization method replaces the given problem by a penalized least-squares problem. It is well known that Tikhonov regularization in standard form may yield appr...

متن کامل

Iterated Tikhonov regularization with a general penalty term

Tikhonov regularization is one of the most popular approaches to solving linear discrete ill-posed problems. The choice of regularization matrix may significantly affect the quality of the computed solution. When the regularization matrix is the identity, iterated Tikhonov regularization can yield computed approximate solutions of higher quality than (standard) Tikhonov regularization. This pap...

متن کامل

Sparsity Reconstruction by the Standard Tikhonov Regularization

It is a common belief that Tikhonov scheme with ‖ · ‖L2 -penalty fails to reconstruct a sparse structure with respect to a given system {φi}. However, in this paper we present a procedure for sparsity reconstruction, which is totally based on the standard Tikhonov method. This procedure consists of two steps. At first Tikhonov scheme is used as a sieve to find the coefficients near φi, which ar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Inverse and Ill-posed Problems

سال: 2019

ISSN: 0928-0219,1569-3945

DOI: 10.1515/jiip-2019-0008